A numerically reliable approach to robust pole assignment for descriptor system
نویسنده
چکیده
We propose a general, numerically reliable computational approach to solve the pole and eigenstructure assignment problem for descriptor systems. In the multi-input case, the proposed approach addresses the intrinsic non-uniqueness of the pole assignment problem solution by simultaneously minimizing the sensitivity of the feedback gain and of closed-loop eigenvalues. For this purpose, a minimum norm robust pole assignment problem is formulated and solved as an unconstrained minimization problem for a suitably chosen cost function. By using a generalized Sylvester equation-based parameterization, an explicit expression of the gradient of the cost function is derived to allow the efficient solution of the minimization problem by using powerful gradient search-based minimization techniques. © 2003 Published by Elsevier Science B.V.
منابع مشابه
/ On Stabilization Methods of Descriptor Systems 3 Algorithm
Numerically reliable computational methods are proposed for the stabilization of a linear descriptor system with or without simultaneous elimination of its impulsive behavior. Two basic stabilization approaches are discussed. The rst approach relies on methods which represent generalizations of direct stabilization techniques for standard state-space systems. The second approach is based on a r...
متن کاملAn LPV Approach to Sensor Fault Diagnosis of Robotic Arm
One of the major challenges in robotic arms is to diagnosis sensor fault. To address this challenge, this paper presents an LPV approach. Initially, the dynamics of a two-link manipulator is modelled with a polytopic linear parameter varying structure and then by using a descriptor system approach and a robust design of a suitable unknown input observer by means of pole placement method along w...
متن کاملRobust pole assignment for descriptor systems
By using a generalized Sylvester equation based parametrization, three minimum norm robust pole assignment problems for descriptor systems are formulated as unconstrained minimization problems for suitably chosen cost functions. The derived explicit expressions of the gradients of the cost functions allow the efficient solution of the minimization problems by using powerful gradient search base...
متن کاملGeneralized Schur Methods to Compute Coprime Factorizations of Rational Matrices
Numerically reliable state space algorithms are proposed for computing the following stable coprime factorizations of rational matrices factorizations with least order denominators factorizations with inner denominators and factorizations with proper stable factors The new algorithms are based on a recursive generalized Schur algorithm for pole assignment They are generally applicable regardles...
متن کاملPartial Eigenvalue Assignment in Discrete-time Descriptor Systems via Derivative State Feedback
A method for solving the descriptor discrete-time linear system is focused. For easily, it is converted to a standard discrete-time linear system by the definition of a derivative state feedback. Then partial eigenvalue assignment is used for obtaining state feedback and solving the standard system. In partial eigenvalue assignment, just a part of the open loop spectrum of the standard linear s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Future Generation Comp. Syst.
دوره 19 شماره
صفحات -
تاریخ انتشار 2003